Implementation and performance evaluation of new inverse iteration algorithm with Householder transformation in terms of the compact WY representation
نویسندگان
چکیده
A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tridiagonal matrix on parallel computers is developed. In the classical inverse iteration algorithm, the modified GramSchmidt orthogonalization is used, and this causes a bottleneck in parallel computing. In this paper, the use of the compact WY representation is proposed in the orthogonalization process of the inverse iteration algorithm with the Householder transformation. This change results in drastically reduced synchronization cost in parallel computing. The new algorithm is evaluated on a 32-core parallel computer, and it is shown that the algorithm is up to 7.46 times faster than the classical algorithm in computing all the eigenvectors of matrices with several thousand dimensions.
منابع مشابه
On Implementation and Evaluation of Inverse Iteration Algorithm with compact WY Orthogonalization
A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tri-diagonal matrix on parallel computers is developed. The modified Gram-Schmidt orthogonalization is used in the classical inverse iteration. This algorithm is sequential and causes a bottleneck in parallel computing. In this paper, the use of the compact WY representation is proposed in the...
متن کاملPerformance Evaluation of Some Inverse Iteration Algorithms on PowerXCell 8i Processor
In this paper, we compare with the inverse iteration algorithms on PowerXCell 8i processor, which has been known as a heterogeneous environment. When some of all the eigenvalues are close together or there are clusters of eigenvalues, reorthogonalization must be adopted to all the eigenvectors associated with such eigenvalues. Reorthogonalization algorithms need a lot of computational cost. The...
متن کاملFPGA Can be Implemented Using Advanced Encryption Standard Algorithm
This paper mainly focused on implementation of AES encryption and decryption standard AES-128. All the transformations of both Encryption and Decryption are simulated using an iterativedesign approach in order to minimize the hardware consumption. This method can make it avery low-complex architecture, especially in saving the hardware resource in implementing theAES InverseSub Bytes module and...
متن کاملAggregations of Elementary Transformations
The techniques of aggregating transformations have been used in the development of blocked algorithms, in particular, the compact representations of aggregated Householder transformation have been wellknown. We show in this paper that the aggregation techniques can be integrated in a framework for aggregating general elementary transformations. The framework consists of three basic compact form...
متن کاملThe study of relation between existence of admissible vectors and amenability and compactness of a locally compact group
The existence of admissible vectors for a locally compact group is closely related to the group's profile. In the compact groups, according to Peter-weyl theorem, every irreducible representation has admissible vector. In this paper, the conditions under which the inverse of this case is being investigated has been investigated. Conditions such as views that are admissible and stable will get c...
متن کامل